A New Lower Bound for Completion Time Distribution Function of Stochastic PERT Networks

Authors

  • K. Rezaie
  • M. M. Lotfi and M. Abadi
  • M. Rabbani
Abstract:

In this paper, a new method for developing a lower bound on exact completion time distribution function of stochastic PERT networks is provided that is based on simplifying the structure of this type of network. The designed mechanism simplifies network structure by arc duplication so that network distribution function can be calculated only with convolution and multiplication. The selection of duplicable arcs in this method differs from that of Dodin’s so that it must be considered a different method. In this method, best duplicable arcs are adopted using a new mechanism. It is proved that duplicating numbers is minimized by this method. The distribution function of this method is a lower bound on exact network distribution function and an upper bound on distribution function of Dodin’s and Kleindorfer’s methods. After the algorithm for the method is presented, its efficiency is discussed and illustration examples will be used to Compare numerical results from this method with those from exact network distribution and Dodin’s method.

Upgrade to premium to download articles

Sign up to access the full text

Already have an account?login

similar resources

A New Approach to Approximate Completion Time Distribution Function of Stochastic Pert Networks

The classical PERT approach uses the path with the largest expected duration as the critical path to estimate the probability of completing a network by a given deadline. However, in general, such a path is not the most critical path (MCP) and does not have the smallest estimate for the probability of completion time. The main idea of this paper is derived from the domination structure between ...

full text

A New Approach to Approximate Completion Time Distribution Function of Stochastic Pert Networks

The classical PERT approach uses the path with the largest expected duration as the critical path to estimate the probability of completing a network by a given deadline. However, in general, such a path is not the most critical path (MCP) and does not have the smallest estimate for the probability of completion time. The main idea of this paper is derived from the domination structure between ...

full text

Fuzzy completion time for alternative stochastic networks

In this paper a network comprising alternative branching nodes with probabilistic outcomes is considered. In other words, network nodes are probabilistic with exclusive-or receiver and exclusive-or emitter. First, an analytical approach is proposed to simplify the structure of network. Then, it is assumed that the duration of activities is positive trapezoidal fuzzy number (TFN). This paper com...

full text

A hybrid method to find cumulative distribution function of completion time of GERT networks

This paper proposes a hybrid method to find cumulative distribution function (CDF) of completion time of GERT-type networks (GTN) which have no loop and have only exclusive-or nodes. Proposed method is cre-ated by combining an analytical transformation with Gaussian quadrature formula. Also the combined crude Monte Carlo simulation and combined conditional Monte Carlo simulation are developed a...

full text

A special Class of Stochastic PERT Networks

Considering the network structure is one of the new approaches in studying stochastic PERT networks (SPN). In this paper, planar networks are studied as a special class of networks. Two structural reducible mechanisms titled arc contraction and deletion are developed to convert any planar network to a series-parallel network structure.&#10In series-parallel SPN, the completion time distribution...

full text

My Resources

Save resource for easier access later

Save to my library Already added to my library

{@ msg_add @}


Journal title

volume 23  issue 1

pages  49- 69

publication date 2004-07

By following a journal you will be notified via email when a new issue of this journal is published.

Keywords

Hosted on Doprax cloud platform doprax.com

copyright © 2015-2023